Various Routing Techniques for non-GEO Satellite Constellations

Two different routing algorithm categories are studied in this paper for a typical LEO satellite constellation. Shortest path algorithms and optimal routing. Their performance is investigated through extended real time simulations. In the context of satellite constellations the basic parameters for a typical network such as delay, throughput, link utilization must be supplemented by new factors imposed by the nature of satellite operation, like the handover procedures, the non-uniformity of load distribution in the space segment and the continuous topology variation. The pros and cons of the techniques are illustrated and helpful conclusions for the network design are provided.